Rademacher complexity of margin multi-category classifiers
نویسندگان
چکیده
منابع مشابه
Rademacher Margin Complexity
where σ1, ...σn are iid Rademacher random variables. Rn(F ) characterizes the extent to which the functions in F can be best correlated with a Rademacher noise sequence. A number of generalization error bounds have been proposed based on Rademacher complexity [1,2]. In this open problem, we introduce a new complexity measure for function classes. We focus on function classes F that is the conve...
متن کاملVC Theory of Large Margin Multi-Category Classifiers
In the context of discriminant analysis, Vapnik’s statistical learning theory has mainly been developed in three directions: the computation of dichotomies with binary-valued functions, the computation of dichotomies with real-valued functions, and the computation of polytomies with functions taking their values in finite sets, typically the set of categories itself. The case of classes of vect...
متن کاملLp-norm Sauer-Shelah lemma for margin multi-category classifiers
In the framework of agnostic learning, one of the main open problems of the theory of multi-category pattern classification is the characterization of the way the complexity varies with the number C of categories. More precisely, if the classifier is characterized only through minimal learnability hypotheses, then the optimal dependency on C that an upper bound on the probability of error shoul...
متن کاملRademacher complexity properties 2: finite classes and margin losses
To make this meaningful to machine learning, we need to replace Ef with some form of risk. Today will discuss three choices. 1. R` where ` is Lipschitz. We covered this last time but will recap a little. 2. Rz(f) := Pr[f(X) 6= Y ]; for this we’ll use finite classes and discuss shatter coefficients and VC dimension. 3. Rγ(f) = R`γ where `γ(z) := max{0,min{z/γ+ 1, 1}} will lead to nice bounds for...
متن کاملRademacher Complexity
Rademacher complexity is a measure of the richness of a class of real-valued functions. In this sense, it is similar to the VC dimension. In fact, we will establish a uniform deviation bound in terms of Rademacher complexity, and then use this result to prove the VC inequality. Unlike VC dimension, however, Rademacher complexity is not restricted to binary functions, and will also prove useful ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computing and Applications
سال: 2018
ISSN: 0941-0643,1433-3058
DOI: 10.1007/s00521-018-3873-7